Combinatorial Unprovability Proofs and Their Model-Theoretic Counterparts
نویسندگان
چکیده
منابع مشابه
Several proofs of PA-unprovability
In this article we give unprovability proofs of several combinatorial statements using the method of indiscernibles. Our first two statements are strong versions of KM (the Kanamori-McAloon principle) and KM(2), (the Kanamori-McAloon principle for pairs) that both allow unexpectedly simple proofs. We proceed to discuss results by A.Weiermann and G.Lee on IΣkprovability/unprovability of the prin...
متن کاملModel theoretic proofs of the incompleteness theorems
Godel's proofs of the incompleteness theorems are frequently discussed in the context of constructive or nitary viewpoint. Godel showed a concrete independent statement of arithmetic and the proof does not contain any transcendental argument. On the other hand, the completeness theorem asserts that a sentence is not derivable from a theory if and only if there exists a model of the theory whi...
متن کاملExact unprovability results for compound well-quasi-ordered combinatorial classes
In this paper we prove general exact unprovability results that show how a threshold between provability and unprovability of a finite well-quasi-orderedness assertion of a combinatorial class is transformed by the sequence-construction, multisetconstruction, cycle-construction and labeled-tree-construction. Provability proofs use asymptotic pigeonhole principle, unprovability proofs use Weierm...
متن کاملCombinatorial Proofs Using Complex Weights
In 1961, Kasteleyn, Fisher, and Temperley gave a result for the number of possible tilings of a 2m× 2n checkerboard with dominoes. Their proof involves the evaluation of a complicated Pfaffian. In this thesis we investigate combinatorial strategies to evaluate the sum of evenly spaced binomial coefficients, and present steps towards a purely combinatorial proof of the 1961 result.
متن کاملGeometric proofs for combinatorial theorems
There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3, 5-quadrangulation. The vertices of a 2, 4-hexangulation of the torus cannot be bicolored. Similar statements hold for 4, 8-triangulations and 2, 6-quadrangulations. We prove these results, of which the first two are known and the others seem t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2014
ISSN: 0029-4527
DOI: 10.1215/00294527-2420654